package class01;

import java.util.Arrays;

/**
 * @author zhangchaoliang
 * create 2022
 * 选择排序算法
 */
public class s2 {

    public static void selectionSort(int[] arr){
        if(arr==null || arr.length<2)
            return;
        for(int i =0;i<arr.length-1;i++){
            int minIndex = i;
            for(int j=i+1;j<arr.length;j++){
                minIndex = arr[j]< arr[minIndex]?j:minIndex;
            }
            swap(arr,minIndex,i);
        }
    }

    public static void swap(int[] arr,int i,int j){
        int tmp = arr[i];
        arr[i]=arr[j];
        arr[j]=tmp;
    }

    public static void comparetation(int[] arr){
        Arrays.sort(arr);
    }

    public static int[] generation(int maxSize,int maxValue){
        int[] arr = new int[(int) ((maxSize+1)*Math.random())];
        for(int i=0;i<arr.length;i++){
            arr[i]=(int) ((maxValue+1)*Math.random())-(int) ((maxValue+1)*Math.random());
        }
        return arr;
    }

    public static int[] copyArray(int[] arr){
        if(arr==null)
            return null;
        int[] arr2 = new int[arr.length];
        for (int i =0;i<arr.length;i++){
            arr2[i] = arr[i];
        }
        return arr2;
    }

    public static boolean isEqual(int[] arr1,int[] arr2){
        if(arr1==null&&arr2==null)
            return true;
        if ((arr1!=null&&arr2==null)||arr1==null&&arr2!=null)
            return false;
        if (arr1.length!=arr2.length)
            return false;
        boolean res = true;
        for(int i = 0;i<arr1.length;i++){
            if (arr1[i]!=arr2[i])
                return false;
        }
        return true;
    }

    public static void printArray(int[] arr){
        if(arr==null)
            return;
        for (int i =0;i<arr.length;i++){
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int maxTime = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean sussced = true;

        for(int i = 0;i<maxTime;i++){
            int[] arr1 = generation(maxSize,maxValue);
            int[] arr2 = copyArray(arr1);
            selectionSort(arr1);
            comparetation(arr2);
            if(!isEqual(arr1,arr2)){
                sussced = false;
                printArray(arr1);
                printArray(arr2);
                break;
            }
        }

        System.out.println(sussced?"成功！":"失败");

    }


}
